Constant-round perfect zero-knowledge computationally convincing protocols
نویسندگان
چکیده
منابع مشابه
Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols
A perfect zero-knowledge interactive protocol allows a prover to convince a veri er of the validity of a statement in a way that does not give the veri er any additional information [GMR,GMW]. Such protocols take place by the exchange of messages back and forth between the prover and the verier. An important measure of e ciency for these protocols is the number of rounds in the interaction. In ...
متن کاملConstant-Round Zero-Knowledge Proofs of Knowledge
In this note, we show the existence of constant-round computational zero-knowledge proofs of knowledge for all NP. The existence of constant-round zero-knowledge proofs was proven by Goldreich and Kahan (Journal of Cryptology, 1996), and the existence of constant-round zeroknowledge arguments of knowledge was proven by Feige and Shamir (CRYPTO 1989). Although it is widely believed that there ex...
متن کاملComputationally Convincing Proofs of Knowledge
The original definition of interactive proof-systems, as given by Goldwasser, Micali and Rackoff, does not impose limits on the prover's computing power [GMR89]. This is also the case for Babai's Arthur-Merlin games IBM88]. Hence, the prover may wish to convince the verifier of the t ru th of an assertion, but it does not really make sense for the prover to convince the verifier that she 1 know...
متن کاملAchieving Constant Round Leakage-Resilient Zero-Knowledge
Recently there has been a huge emphasis on constructing cryptographic protocols that maintain their security guarantees even in the presence of side channel attacks. Such attacks exploit the physical characteristics of a cryptographic device to learn useful information about the internal state of the device. Designing protocols that deliver meaningful security even in the presence of such leaka...
متن کاملOn Constant-Round Concurrent Zero-Knowledge
Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open question regarding zero-knowledge is whether constant-round concurrent zero-knowledge proofs exists for nontrivial languages. We answer this question to the affirmative when modeling “efficient adversaries” as probabilistic quasi-polyno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90259-5